Reachability Problems in Quaternion Matrix and Rotation Semigroups
نویسندگان
چکیده
We examine computational problems on quaternion matrix and rotation semigroups. It is shown that in the ultimate case of quaternion matrices, in which multiplication is still associative, most of the decision problems for matrix semigroups are undecidable in dimension two. The geometric interpretation of matrix problems over quaternions is presented in terms of rotation problems for the 2 and 3-sphere. In particular, we show that the reachability of the rotation problem is undecidable on the 3-sphere and other rotation problems can be formulated as matrix problems over complex and hypercomplex numbers.
منابع مشابه
Computational problems in matrix semigroups
This thesis deals with computational problems that are defined on matrix semigroups, which play a pivotal role in Mathematics and Computer Science in such areas as control theory, dynamical systems, hybrid systems, computational geometry and both classical and quantum computing to name but a few. Properties that researchers wish to study in such fields often turn out to be questions regarding t...
متن کاملScalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages
There has been much research into freeness properties of finitely generated matrix semigroups under various constraints, mainly related to the dimensions of the generator matrices and the semiring over which the matrices are defined. A recent paper has also investigated freeness properties of matrices within a bounded language of matrices, which are of the form M1M2 · · ·Mk ⊆ Fn×n for some semi...
متن کاملOn the Computational Complexity of Matrix Semigroup Problems
Most computational problems for matrix semigroups and groups are inherently difficult to solve and even undecidable starting from dimension three. The questions about the decidability and complexity of problems for two-dimensional matrix semigroups remain open and are directly linked with other challenging problems in the field. In this paper we study the computational complexity of the problem...
متن کاملUndecidability Bounds for Integer Matrices Using Claus Instances
There are several known undecidability problems for 3×3 integer matrices the proof of which uses a reduction from the Post Correspondence Problem (PCP). We establish new lower bounds in the numbers of matrices for the mortality, zero in left upper corner, vector reachability, matrix reachability, scaler reachability and freeness problems. Also, we give a short proof for a strengthened result du...
متن کاملRotation Representations and Performance Issues
3 Quaternion Representation 5 3.1 Axis-Angle to Quaternion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.2 Quaternion to Axis-Angle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.3 Quaternion to Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.4 Matrix to Quaternion . . . . . . . . . . ....
متن کامل